Parallel Tools for Solving Incremental Dense Least Squares Problems: Application to Space Geodesy
نویسندگان
چکیده
منابع مشابه
Parallel tools for solving incremental dense least squares problems: application to space geodesy
We present a parallel distributed solver that enables us to solve incremental dense least squares arising in some parameter estimation problems. This solver is based on ScaLAPACK [8] and PBLAS [9] kernel routines. In the incremental process, the observations are collected periodically and the solver updates the solution with new observations using a QR factorization algorithm. It uses a recentl...
متن کاملParallel tools for solving incremental dense least squares
We present a parallel distributed solver that enables us to solve incremental dense least squares arising in some parameter estimation problems. This solver is based on ScaLAPACK [8] and PBLAS [9] kernel routines. In the incremental process, the observations are collected periodically and the solver updates the solution with new observations using a QR factorization algorithm. It uses a recentl...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملIncremental Cholesky Factorization for Least Squares Problems in Robotics
Online applications in robotics, computer vision, and computer graphics rely on efficiently solving the associated nolinear systems every step. Iteratively solving the non-linear system every step becomes very expensive if the size of the problem grows. This can be mitigated by incrementally updating the linear system and changing the linearization point only if needed. This paper proposes an i...
متن کاملLinear Least Least Simplified Neural Networks for Solving Squares Problems in Real Time Squares and Total
In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2009
ISSN: 1748-3026,1748-3026
DOI: 10.1260/174830109787186541